Sequentially Perfect and Uniform One-Factorizations of the Complete Graph
نویسندگان
چکیده
منابع مشابه
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph
In this paper, we consider a weakening of the definitions of uniform and perfect one-factorizations of the complete graph. Basically, we want to order the 2n − 1 one-factors of a one-factorization of the complete graph K2n in such a way that the union of any two (cyclically) consecutive one-factors is always isomorphic to the same two-regular graph. This property is termed sequentially uniform;...
متن کاملPrimitive 2-factorizations of the complete graph
LetF be a 2-factorization of the complete graphKv admitting an automorphism groupG acting primitively on the set of vertices. IfF consists of Hamiltonian cycles, thenF is the unique, up to isomorphisms, 2-factorization ofKpn admitting an automorphism group which acts 2-transitively on the vertex-set, see [A. Bonisoli, M. Buratti, G. Mazzuoccolo, Doubly transitive 2-factorizations, J. Combin.Des...
متن کاملPerfect one-factorizations in generalized Petersen graphs
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. We consider the case in which G is a cubic graph. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. We give conditions for determining P1F graphs within a subfamily of...
متن کاملA census of one-factorizations of the complete 3-uniform hypergraph of order 9
The one-factorizations of the complete 3-uniform hypergraph with 9 vertices, K 9 , are classified by means of an exhaustive computer search. It is shown that the number of isomorphism classes of such one-factorizations is 103 000.
متن کاملCycle factorizations and one-faced graph embeddings
Consider factorizations into transpositions of an n-cycle in the symmetric group Sn. To every such factorization we assign a monomial in variables wij that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-fac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1898